Stochastic Pruning
نویسندگان
چکیده
Many renderers perform poorly on scenes that contain a lot of detailed geometry. Level-of-detail techniques can alleviate the load on the renderer by creating simplified representations of primitives that are small on the screen. Current methods work well when the detail is due to the complexity of the individual elements, but not when it is due to the large number of elements. In this paper, we introduce a technique for automatically simplifying this latter type of geometric complexity. Some elements are pruned (i.e., eliminated), and the remaining elements are altered to preserve the statistical properties of the scene. CR Categories: I.3.3 [Picture/Image generation]: Antialiasing— [I.3.7]: Three-Dimensional Graphics and Realism—Color, shading, shadowing, and texture
منابع مشابه
Search Pruning with Soft Biometric Systems: Efficiency-Reliability Tradeoff
In the setting of computer vision, algorithmic searches often aim to identify an object inside large sets of images or videos. Towards reducing the often astronomical complexity of this search, one can use pruning to filter out sufficiently distinct objects, thus resulting in a pruning gain of an overall reduced search space. Motivated by practical scenarios such as time-constrained human ident...
متن کاملLearning Stochastic Bracketing Inversion Transduction Grammars with a Cubic Time Biparsing Algorithm
We present a biparsing algorithm for Stochastic Bracketing Inversion Transduction Grammars that runs in O(bn3) time instead of O(n6). Transduction grammars learned via an EM estimation procedure based on this biparsing algorithm are evaluated directly on the translation task, by building a phrase-based statistical MT system on top of the alignments dictated by Viterbi parses under the induced b...
متن کاملStochastic Activation Pruning for Robust Adversarial Defense
Neural networks have been found vulnerable to adversarial examples. Carefully chosen perturbations to real images, while imperceptible to humans, induce misclassification and threaten the reliability of deep learning systems in the wild. To guard against adversarial examples, we take inspiration from game theory. We cast the problem as a minimax zero-sum game between the adversary and the model...
متن کاملHomogeneous Superpixels from Markov Random Walks
This paper presents a novel algorithm to generate homogeneous superpixels from Markov random walks. We exploit Markov clustering (MCL) as the methodology, a generic graph clustering method based on stochastic flow circulation. In particular, we introduce a graph pruning strategy called compact pruning in order to capture intrinsic local image structure. The resulting superpixels are homogeneous...
متن کاملStochastic Lexicalized Inversion Transduction Grammar for Alignment
We present a version of Inversion Transduction Grammar where rule probabilities are lexicalized throughout the synchronous parse tree, along with pruning techniques for efficient training. Alignment results improve over unlexicalized ITG on short sentences for which full EM is feasible, but pruning seems to have a negative impact on longer sentences.
متن کاملInvestigating Effect of Short, Medium, and Long Pruning on Yield And Yield Components of Tayefi Grape Before and After Winter Cold
One of the most important operations in managed gardens is pruned grapes. For evaluate the effect of pruning short, medium, heavy on yield and yield components of Taif grapes, before and after the cold winter, in the years 2012 to 2013, A factorial experiment in a CRBD design with five replicates were performed on two factors. The first factor was the number of buds per stem and included the th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006